Parallel IQMR Method for Unsymmetric Large and Sparse Linear Systems in Computational Fluid Dynamics
نویسنده
چکیده
| We mainly examine the application of the improved version of the quasi-minimal residual (IQMR) method 20], 21] for the solutions of linear systems of equations with unsymmetric coeecient matrices arising from the discretization of uid dynamic problems on massively parallel distributed memory computers. We will deal with implicit nite diierence schemes for solving the Euler equations. These schemes may arise from the implicit treatment of the time dependent equations or from the use of New-ton's method for the solution of the steady state equations. In both situations it is very necessary to solve a large and sparse unsymmetric linear systems at each iteration. We will examine the eeectiveness of IQMR in the solution of these systems. We compared the resulting method to some existed approaches by numerical experimental results carried out on massively parallel distributed memory computer Parsytec GC/PowerPlus. Our goal is to show that the IQMR method is a more eecient alternative for solving implicit computational uid dynamics problems.
منابع مشابه
An effective method for eigen-problem solution of fluid-structure systems
Efficient mode shape extraction of fluid-structure systems is of particular interest in engineering. An efficient modified version of unsymmetric Lanczos method is proposed in this paper. The original unsymmetric Lanczos method was applied to general form of unsymmetric matrices, while the proposed method is developed particularly for the fluid-structure matrices. The method provides us with si...
متن کاملThe Improved Quasi - Minimal Residual
For the solutions of linear systems of equations with unsymmetric coeecient matrices, we propose an improved version of the quasi-minimal residual (IQMR) method by using the Lanczos process as a major component combining elements of numerical stability and parallel algorithm design. For Lanczos process, stability is obtained by a coupled two-term procedure that generates Lanczos vectors normali...
متن کاملSolving Unsymmetric Sparse Systems of Linear Equations with PARDISO
Supernode partitioning for unsymmetric matrices together with complete block diagonal supernode pivoting and asynchronous computation can achieve high gigaflop rates for parallel sparse LU factorization on shared memory parallel computers. The progress in weighted graph matching algorithms helps to extend these concepts further and unsymmetric prepermutation of rows is used to place large matri...
متن کاملA Large-Grain Parallel Sparse System Solver
The eeciency of solving sparse linear systems on parallel processors and more complex multicluster architectures such as Cedar is greatly enhanced if relatively large grain computational tasks can be assigned to each cluster or processor. The ordering of a system into a bordered block upper triangular form facilitates a reasonable large-grain partitioning. A new algorithm which produces this fo...
متن کاملNUMERICAL ANALYSIS GROUP PROGRESS REPORT January 1994 – December 1995
2 Sparse Matrices ……………………………………………………………………………… 4 2.1 The direct solution of sparse unsymmetric linear sets of equations (I.S. Duff and J.K. Reid) …………………………………………………………………………… 4 2.2 The design and use of algorithms for permuting large entries to the diagonal 2.6 Element resequencing for use with a multiple front solver (J. A. Scott) ………… 10 2.7 Exploiting zeros on the diagonal in the direct s...
متن کامل